package com.sxkiler.demo.hard;

import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;
import java.util.*;
import com.sxkiler.demo.model.*;

/**
longest-valid-parentheses=最长有效括号
<p>给定一个只包含 <code>'('</code>&nbsp;和 <code>')'</code>&nbsp;的字符串，找出最长的包含有效括号的子串的长度。</p>

<p><strong>示例&nbsp;1:</strong></p>

<pre><strong>输入:</strong> "(()"
<strong>输出:</strong> 2
<strong>解释:</strong> 最长有效括号子串为 <code>"()"</code>
</pre>

<p><strong>示例 2:</strong></p>

<pre><strong>输入:</strong> "<code>)()())</code>"
<strong>输出:</strong> 4
<strong>解释:</strong> 最长有效括号子串为 <code>"()()"</code>
</pre>

 */
public class longestValidParentheses {
    

    class Solution {
        public Integer longestValidParentheses(String param0) {
            return null;
        }
    }

    @Test
    public void test(){
        Solution solution = new Solution();
        /**
        "(()"
        */
        //int [] num1 = new int[]{1,3};
        //int [] num2 = new int[]{2};
        //Assertions.assertEquals(solution.{{questionName}}(num1,num2),2);
    }
}

